Computing the degree of a lattice ideal of dimension one
نویسندگان
چکیده
We show that the degree of a graded lattice ideal of dimension 1 is the order of the torsion subgroup of the quotient group of the lattice. This gives an efficient method to compute the degree of this type of lattice ideals.
منابع مشابه
A degree bound for the Graver basis of non-saturated lattices
Let $L$ be a lattice in $ZZ^n$ of dimension $m$. We prove that there exist integer constants $D$ and $M$ which are basis-independent such that the total degree of any Graver element of $L$ is not greater than $m(n-m+1)MD$. The case $M=1$ occurs precisely when $L$ is saturated, and in this case the bound is a reformulation of a well-known bound given by several authors. As a corollary, we show t...
متن کاملIdeal of Lattice homomorphisms corresponding to the products of two arbitrary lattices and the lattice [2]
Abstract. Let L and M be two finite lattices. The ideal J(L,M) is a monomial ideal in a specific polynomial ring and whose minimal monomial generators correspond to lattice homomorphisms ϕ: L→M. This ideal is called the ideal of lattice homomorphism. In this paper, we study J(L,M) in the case that L is the product of two lattices L_1 and L_2 and M is the chain [2]. We first characterize the set...
متن کاملSoft Computing Based on a Modified MCDM Approach under Intuitionistic Fuzzy Sets
The current study set to extend a new VIKOR method as a compromise ranking approach to solve multiple criteria decision-making (MCDM) problems through intuitionistic fuzzy analysis. Using compromise method in MCDM problems contributes to the selection of an alternative as close as possible to the positive ideal solution and far away from the negative ideal solution, concurrently. Using Atanasso...
متن کاملTHE INTERNAL IDEAL LATTICE IN THE TOPOS OF M-SETS
We believe that the study of the notions of universal algebra modelled in an arbitarry topos rather than in the category of sets provides a deeper understanding of the real features of the algebraic notions. [2], [3], [4], [S], [6], [7], [13], [14] are some examples of this approach. The lattice Id(L) of ideals of a lattice L (in the category of sets) is an important ingredient of the categ...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2014